Hierarchical Sequence Clustering Algorithm for Data Mining
نویسندگان
چکیده
Bioinformatics emerged as a challenging new area of research and brought forth numerous computational problems. Here computers are used to gather, store, analyze and merge biological data. In this paper, the problem of clustering interval-scaled data and sequence data is analyzed in a new approach using Hierarchical Sequence Clustering. In Sequence clustering, it is necessary to find the similarity or distance between each pair of sequences. To find the similarity between sequences the data structure Probabilistic Suffix Tree can be used. An agglomerative algorithm is introduced based on UPGMA (Un weighted Pair wise Group Average Method) cluster analysis, that required O(n) of total computing time. Then a new algorithm using the new approach is introduced with O(n) computing time. The result of this new algorithm is compared with UPGMA cluster analysis.
منابع مشابه
High-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملخوشهبندی اسناد مبتنی بر آنتولوژی و رویکرد فازی
Data mining, also known as knowledge discovery in database, is the process to discover unknown knowledge from a large amount of data. Text mining is to apply data mining techniques to extract knowledge from unstructured text. Text clustering is one of important techniques of text mining, which is the unsupervised classification of similar documents into different groups. The most important step...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملMultilevel Refinement for Hierarchical Clustering
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in which each clustering is nested into the next clustering in the sequence. Since hierarchical clustering is a greedy search algorithm based on a local search, the merging decision made early in the agglo...
متن کامل2 Review of Agglomerative Hierarchical Clustering Algorithms
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in which each clustering is nested into the next clustering in the sequence. Since hierarchical clustering is a greedy search algorithm based on a local search, the merging decision made early in the agglo...
متن کامل